Improved Decoding of linear Block Codes using compact Genetic Algorithms with larger tournament size
نویسندگان
چکیده
Soft-decision decoding is a very important NP-hard problem for developers of communication systems. In this work we propose two new dual domain soft decision decoders that use compact Genetic Algorithm (cGA) with larger tournament size: the first algorithm investigates tournament selection with larger size using mutation, and the second employs higher selection pressure with randomly generated individuals. The obtained results are compared to known previous works and show the effectiveness of using larger tournament size in dual domain soft decision decoding problem. Behind performances analysis, a complexity study is done which shows that both proposed decoders are not very complex in comparison with the standard compact Genetic Algorithm based decoder (cGAD).
منابع مشابه
An Efficient Soft Decoder of Block Codes Based on Compact Genetic Algorithm
Soft-decision decoding is an NP-hard problem with great interest to developers of communication systems. We present an efficient soft-decision decoder of linear block codes based on compact genetic algorithm (cGA) and compare its performances with various other decoding algorithms including Shakeel algorithm. The proposed algorithm uses the dual code in contrast to Shakeel algorithm which uses ...
متن کاملMetaheuristic Algorithms for Decoding Binary Linear Codes
This paper introduces two decoders for binary linear codes based on Metaheuristics. The first one uses a genetic algorithm and the second is based on a combination genetic algorithm with a feed forward neural network. The decoder based on the genetic algorithms (DAG) applied to BCH and convolutional codes give good performances compared to Chase-2 and Viterbi algorithm respectively and reach th...
متن کاملA Soft Decoding of Linear Block Codes by Genetic Algorithms
Abstract— In this paper, we present a hard-decision decoding technique based on Genetic Algorithms (HDGA), which is applicable to the general case where the only known structure is given by the generating matrix G. We also present a new soft-decision decoding based on HDGA and the Chase algorithm (SDGA). The simulations, applied on some binary Linear Block Codes, show that the genetic decoder h...
متن کاملDecoding of Block Codes by using Genetic Algorithms and Permutations Set
Recently Genetic algorithms are successfully used for decoding some classes of error correcting codes. For decoding a linear block code C, these genetic algorithms computes a permutation π of the code generator matrix depending of the received word. Our main contribution in this paper is to choose the permutation π from the automorphism group of C. This choice allows reducing the complexity of ...
متن کاملHybrid Maximum Likelihood Decoding for Linear Block Codes
In this paper we propose a hybrid maximum likelihood decoding (MLD) for linear block codes. For the reliable data transmission over noisy channels, convolutional and block codes are widely used in most digital communication systems. Much more efficient algorithms have been found for using channel measurement information in the decoding of convolutional codes than in the decoding of block codes....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017